例文
- The algorithm applies a simple clique finding and weighted coloring to determine lower and upper bounds , and actives exactly one new search tree node at each branching stage which using the information obtained in the weighted coloring to choose a branching vertex , and uses backtracking method to obtain optimum solution